Total Protection of Analytic Invariant Information in Cross Tabulated Tables
نویسنده
چکیده
To protect sensitive information in a cross tabulated table, it is a common practice to suppress some of the cells in the table. An analytic invariant is a power series in terms of the suppressed cells that has a unique feasible value and a convergence radius equal to +∞. Intuitively, the information contained in an invariant is not protected even though the values of the suppressed cells are not disclosed. This paper gives an optimal linear-time algorithm for testing whether there exist nontrivial analytic invariants in terms of the suppressed cells in a given set of suppressed cells. This paper also presents NP-completeness results and an almost linear-time algorithm for the problem of suppressing the minimum number of cells in addition to the sensitive ones so that the resulting table does not leak analytic invariant information about a given set of suppressed cells.
منابع مشابه
Radiative recombination and photoionization cross sections for heavy element impurities in plasmas
We have performed fully relativistic Dirac–Fock calculations of total cross sections for radiative recombination of heavy element impurities with electrons and subshell photoionization cross sections for 31 ions of Fe, Ni, Cu, Mo, and W, which are important elements in plasma studies. The electron kinetic energy range is 4 eV to 50 keV. To obtain the total radiative recombination cross section,...
متن کاملHigh-Speed and Cost-Effective Data Protection for Oracle Engineered Systems
• Real-time analysis and diagnosis of performance • Pre-configured solution streamlines deployment • Single vendor support Key Advantages of the Oracle ZFS Storage ZS3-BA • Application engineered storage specifically designed for Oracle engineered systems and other Oracle platforms, including unique integration with Oracle Database • High performance dramatically reduces backup windows and rest...
متن کاملVerification of Interlockings: from Control Tables to Ladder Logic Diagrams
Dependency relations between objects in a railway yard are tabulated in control tables. An interlocking, which guarantees validity of these dependencies, can be implemented in ladder logic. We transform a ladder logic diagram into a Boolean formula, so that validity of the dependencies in the control tables can be verified using a theorem prover. Time copies and invariants are added to the form...
متن کاملVeri cation of Interlockings: from Control Tables to Ladder Logic Diagrams
Dependency relations between objects in a railway yard are tabulated in control tables. An interlocking, which guarantees validity of these dependencies, can be implemented in ladder logic. We transform a ladder logic diagram into a Boolean formula, so that validity of the dependencies in the control tables can be veri ed using a theorem prover. Time copies and invariants are added to the formu...
متن کاملPreserving confidentiality of high-dimensional tabulated data: Statistical and computational issues
Dissemination of information derived from large contingency tables formed from confidential data is a major responsibility of statistical agencies. In this paper we present solutions to several computational and algorithmic problems that arise in the dissemination of cross-tabulations (marginal sub-tables) from a single underlying table. These include data structures that exploit sparsity to su...
متن کامل